\documentclass{report}       %--- LATEX 2e base
\linespread{1.3} 
\setcounter{secnumdepth}{3}

\usepackage{amstext,amssymb,amsfonts,latexsym,amsmath,color}
\usepackage{theorem}
\usepackage{pifont}
\usepackage{graphics,epsfig}
\usepackage{graphicx}
\usepackage{makeidx}
\usepackage{float,times}
\usepackage{wrapfig}
\usepackage{url}
\makeindex

\renewcommand{\topfraction}{0.85}
\renewcommand{\textfraction}{0.1}
%%%%%%%%%% Start TeXmacs macros
\newcommand{\tmem}[1]{{\em #1\/}}
\newcommand{\tmop}[1]{\ensuremath{\operatorname{#1}}}
\definecolor{grey}{rgb}{0.75,0.75,0.75}
\definecolor{orange}{rgb}{1.0,0.5,0.5}
\definecolor{brown}{rgb}{0.5,0.25,0.0}
\definecolor{pink}{rgb}{1.0,0.5,0.5}
%%%%%%%%%% End TeXmacs macros

%---------------- Wide format -----------------------------------------------
\textwidth=6in \textheight=9in \oddsidemargin=0.25in
\evensidemargin=0.25in \topmargin=-0.5in

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% Theorems, etc.
    \def\bbox{\vrule height6pt width6pt depth1pt}
    \theoremstyle{plain}
    \theoremheaderfont{\bfseries}
    \setlength{\theorempreskipamount}{3mm}
    \setlength{\theorempostskipamount}{3mm}
    \newtheorem{theorem}{Theorem}[section]
    \newtheorem{lemma}[theorem]{Lemma}
    \newtheorem{proposition}[theorem]{Proposition}
    \newtheorem{corollary}[theorem]{Corollary}
    \newtheorem{fact}[theorem]{Fact.}
    \newtheorem{openproblem}[theorem]{Open Problem}
    \newtheorem{conjecture}[theorem]{Conjecture}

    {\theorembodyfont{\rmfamily}
        \newtheorem{definition}[theorem]{Definition}}
    {\theorembodyfont{\rmfamily} \newtheorem{example}[theorem]{Example}}
    {\theorembodyfont{\rmfamily} \newtheorem{remark}[theorem]{Remark}}
    \newtheorem{claim}{Claim}
    \newtheorem{appendixlemma}{Lemma~A.\hs{-1}}
    \newenvironment{proof}{\par \noindent
                {\bf Proof. l\hs{2}}}{\hfill$\Box$ \vspace*{3mm}}
    \newenvironment{proofsketch}{\par \noindent
                {\bf Proof Sketch. \hs{2}}}{\hfill\bbox \vspace*{3mm}}
     \newenvironment{proofof}[1]{\vspace*{5mm} \par \noindent
            {\bf Proof of #1.\hs{2}}}{\hfill$\Box$ \vspace*{3mm}}
    \newcommand{\qed}{\hfill$\Box$ \bs}


    \floatstyle{ruled}
    \newfloat{output}{htp}{lop}[section]

    \floatstyle{ruled}
    \newfloat{Program}{htp}{lop}[section]

    \floatstyle{ruled}
    \newfloat{context}{htp}{lop}[section]

    \theoremstyle{plain}
    \setlength{\theorempreskipamount}{1mm}
    \setlength{\theorempostskipamount}{1mm}
    {\theorembodyfont{\small}
        \newtheorem{comment}{Comment}[section]}
    \input{abbrevs.tex}
    \input{command.tex}
% ===========================================================================
\renewcommand{\theenumi}{\arabic{enumi}}
\renewcommand{\theenumii}{\roman{enumii}}
\renewcommand{\theenumiii}{\alpha{enumiii}}

\begin{document}
\include{frontPage}

\pagestyle{plain}
\setcounter{page}{2}
\newpage

\pagenumbering{Roman}
\begin{abstract}
This thesis describes a novel method for representing and automatically generating
computer programs in an evolutionary computation context. \ABGP{ }(ABGP) is a typed Genetic Programming representation system that uses \SF{}, an expressive $\lambda$-calculus, to represent
the computational components from which the evolved programs are assembled. ABGP is based on
the manipulation of closed, independent modules expressing
computations with effects that have the ability to affect the whole genotype . These modules
are plugged into other modules according to precisely defined rules to form complete, partially-specified
computer programs. The use of \SF{}  allows the straightforward representation and use
of many typical computational  structures and behaviors  (such as iteration, recursion, lists and trees) in modular form. This is done without
introducing additional external symbols in the set of predefined functions and terminals of the
system. In fact, programming structures typically included in GP terminal sets,
such as $\mathit{if\_then\_else}$, may be removed and represented as abstractions in ABGP for
the same problems. ABGP also provides a search space partitioning system based on the structure of the genotypes, similar to the species partitioning system of living organisms and derived from the Curry-Howard isomorphism.  This thesis also presents the results
obtained by applying this method to a set of problems.
\end{abstract}
\newpage

\tableofcontents
\newpage
\listoffigures
\newpage
\listoftables
\newpage
\chapter{Introduction}\label{Introduction}
\pagenumbering{arabic}\input{chapter1}
\chapter{GP General Concepts}\label{BasGP}\input{chapter2}
\chapter{GP Representation Specific Work}\label{PreviousWork}\input{chapter3}
\chapter{Design and Motivation}\label{Motivation}\input{chapter4}
\chapter{\SF}\label{SystemF}\input{systemf}
\chapter{\ABGP}\label{SFGP}\input{chapter6}
\chapter{Results}\label{Results}\input{chapter7}
\chapter{Discussion}\label{Discussion}\input{DiscussionChapter}

%MODIFICATION_D changed biblio style
\bibliographystyle{plain}
\bibliography{biblio}
\printindex
\appendix
\chapter{The ABGP Software}\label{ABGPSoftware}\input{ABGPSoftwareScreens}
\chapter{The $ABGP$ important function}\label{importantFunction}\input{make_constructors}
\chapter{Mutation Rules for Genes}\label{mutgenerules}\input{GeneMutationRulesAppendix}
\chapter{Gene Pool Examples}\label{GPeg}\input{gene_pool_egs}

% ============================================================================
\end{document}
% ============================================================================
